Welcome![Sign In][Sign Up]
Location:
Search - maximum matching

Search list

[matlabgraphprogramming

Description: 解决图论中Warshall-Floyd 算法,Kruskal 避圈法,匈牙利算法,求最佳匹配的算法,求最大流的Ford--Fulkerson 标号算法,求解最小费用流问题的matlab程序-Solve the graph theory Warshall-Floyd algorithm, Kruskal avoid lap law, Hungary algorithm, and the best matching algorithm, for maximum flow of the Ford- Fulkerson labeling algorithm for solving the minimum cost flow problem of matlab procedures
Platform: | Size: 47104 | Author: yangfei | Hits:

[Data structsmatch

Description: 三个求二分图最大匹配的程序(bfs,dfs,多增光路算法)-Three for the maximum bipartite graph matching procedure (bfs, dfs, multi-path algorithm Zengguang)
Platform: | Size: 1024 | Author: liulanzheng | Hits:

[AI-NN-PRhungray

Description: 二分图匹配-匈牙利算法 效率很高,求二分图最大匹配。-Bipartite graph matching- Hungary algorithm highly efficient, and the maximum bipartite graph matching.
Platform: | Size: 1024 | Author: 方宇浩 | Hits:

[Documentsimagemosic

Description: 针对基于图像特征点的配准方法中对应特征对难以准确提取的问题,提出一种基于兴趣 点匹配的图像自动拼接方法。该方法首先利用Harris角检测器提取两幅图像中的兴趣点,并在此基 础上采用比较最大值法提取出对应兴趣点特征对,最后利用这些匹配特征对来实现图像的拼接。实 验结果表明,这种方法能有效地去除伪匹配特征对的干扰,同时降低了误匹配的概率-Feature points for image-based registration method of the corresponding characteristics of the problem difficult to accurately extract and put forward a point of interest-based image matching method of automatic splicing. This method is the first to use Harris angle detector extract two images in the interest of points, and based on this law was adopted to extract the maximum value corresponds to points of interest characteristics of the final use of these matching characteristics of images to achieve splicing. The experimental results show that this method can effectively remove the pseudo-matching characteristics of the interference, while reducing the probability of false matches
Platform: | Size: 3325952 | Author: zhangjia | Hits:

[Othercalendar

Description: 寿星万年历是一款采用现代天文算法制作的农历历算程序,含有公历与回历信息,可以很方便的进行公、农、回三历之间的转换。提供公元-4712年到公元9999年的日期查询功能。其中1500年到1940农历数据已经与陈垣的《二十史朔闰表》核对;含有从公420元(南北朝/宋武帝元年)到今的基本年号。在过去几百年中,寿星万年历的误差是非常小的,节气时刻计算及日月合朔时刻的平均误差小于1秒,太阳坐标的最大可能误差为0.2角秒,月亮坐标的最大可能误差为3角秒,平均误差为误差的1/6。万年历中含有几百个国内城市的经纬度,并且用户可根据自已的需要扩展经纬度数据-Shouxing calendar is a use of modern astronomical algorithms produced by the Lunar calendar program, calendar and return to the calendar containing information can be very convenient for the public and farmers, between the back three calendar conversion. Provide AD-4712 AD 9999 to the date of the inquiry. 1500 to 1940, one of the Lunar New data has Yuan s "History of Twenty Schomburg Darun Table" matching contains 420 from the public (the Northern and Southern Dynasties/Song Emperor first year) to this basic reign title. In the past several hundred years, the calendar Shouxing error is very small, cycle time calculation and the sun combined Schomburg moment the average error is less than one second, the sun coordinates the greatest possible error is 0.2 arcsec, the moon coordinates of the maximum possible error is 3 arcsec, with an average error of error of 1/6. Calendar contains hundreds of latitude and longitude of domestic cities, and users may need to be extended in accordanc
Platform: | Size: 117760 | Author: ccq | Hits:

[Data structsACM_template

Description: 本人参加ACM竞赛使用的一些算法模板,包括二分图匹配,欧拉回路的构造以及网络流中的最大流与最小费用最大流等,可以说实战性非常强。-ACM competitions I take part in a number of algorithms used in templates, including two sub-graph matching, Euler circuit, as well as network flow structure of the maximum flow and minimum cost maximum flow, etc., it can be said of very strong combat.
Platform: | Size: 14336 | Author: 诗苇 | Hits:

[Windows Develop2771

Description: poj 2771 一道关于二分图的最大匹配-poj 2771 on the maximum bipartite graph matching
Platform: | Size: 1024 | Author: zl | Hits:

[Otherxq

Description: 图论中最短路算法,最小生成树,最大匹配与最佳匹配的算法,旅行商问题,求最大流的Ford--Fulkerson 标号算法-Shortest path graph algorithm, minimum spanning tree, the largest and best match matching algorithms, traveling salesman problem, maximum flow for the Ford- Fulkerson labeling algorithm
Platform: | Size: 40960 | Author: 夏秋 | Hits:

[Mathimatics-Numerical algorithmspoj1469

Description: poj1469, 二分图最大匹配,最大匹配-poj1469, Maximum Bipartite Matching
Platform: | Size: 1024 | Author: william | Hits:

[Special EffectsThe_flow_and_the_maximal_matching1

Description: 关于最大流问题,与最大匹配的讲解。内容比较浅显易懂。-On the maximum flow problem, with the largest matching explained. The study were easy to understand.
Platform: | Size: 359424 | Author: 姜珊珊 | Hits:

[Data structsHungaryAlgorithm

Description: 匈牙利算法,实现求二分图最大匹配,还有一些资料,实现的语言是C-Hungarian algorithm, seeking to achieve the maximum bipartite matching, there are some data to realize the language is C++
Platform: | Size: 41984 | Author: chenchencehn | Hits:

[matlabMCMProjects

Description: 我备战2010数学建模美赛所精心准备的算法资料,一共13个算法。应该说是目前比较全的算法集了。每个算法由一个VC6例子实现,来解决一个问题。其中一些是自己编写,其它的也是由网上找到后经过修改编译通过的。比赛结果还不错,一个M,现在把资料共享出来,希望对大家有所帮助,算法主要有模拟退火,遗传算法,蒙特卡罗算法,蚁群算法,粒子群算法,元胞自动机,Dijkstra,最小生成树算法,二分图最大匹配算法,最大流算法,动态规划算法,分支定界法,排队论算法,决策论算法等,我写了个说明文件,列的挺详细的-I am preparing for 2010 U.S. race mathematical modeling algorithms are well-prepared data, a total of 13 algorithms. It should be said is a relatively wide set of algorithms. Each algorithm implementation from a VC6 example, to solve a problem. Some of which I have written, the other is modified by the web, compiled by the post. Results also good, a M, is now sharing the information out, we want to help, mainly simulated annealing algorithm, genetic algorithm, Monte Carlo algorithm, ant colony algorithm, particle swarm optimization, cellular automata, Dijkstra, minimum spanning tree algorithm, the maximum bipartite matching algorithm, maximum flow algorithm, dynamic programming, branch and bound method, queuing theory algorithms, decision theory algorithm, I wrote a documentation out very detailed
Platform: | Size: 1355776 | Author: 一招鲜 | Hits:

[Windows Developgraphtheory

Description: 5个关于图论的算法 包括K短路问题 NLOGN问题 二分图匹配问题 费用流问题 最大流问题-5 on the graph theory algorithms, including K shortest path problem NLOGN problems cost bipartite matching maximum flow flow
Platform: | Size: 547840 | Author: 李驷聪 | Hits:

[SCM434MHzLoopAntenna(AN3401)

Description: This application note shows the typical impedance values for small loops and suggests matching networks for these impedances. It demonstrates the effectiveness of these networks in suppressing harmonics of the transmitted frequency. Most transmitter ICs that serve these applications, like the Maxim MAX7044, MAX1472, and MAX1479, are biased for maximum efficiency rather than maximum linearity, which means that the harmonic content of the power amplifier (PA) output may be very high. Regulatory agencies in all countries where these devices are used restrict spurious emissions, so attenuating harmonic power from the PA is very important.
Platform: | Size: 51200 | Author: azher | Hits:

[Communication-MobileIMPEDANCE_MATCHING

Description: IMPEDANCE MATCHING 1-Main principles (conjugate matching, maximum delivered power) 2-Smith chart 3-Matching with lumped elements 4-Matching with transmission lines 5-Determination of active device impedances 6-Types of transmission lines (coaxial line, stripline,microstrip line,slotline, coplanar waveguide)-IMPEDANCE MATCHING 1-Main principles (conjugate matching, maximum delivered power) 2-Smith chart 3-Matching with lumped elements 4-Matching with transmission lines 5-Determination of active device impedances 6-Types of transmission lines (coaxial line, stripline,microstrip line,slotline, coplanar waveguide)
Platform: | Size: 1788928 | Author: shn | Hits:

[VC/MFC12

Description: 一种基于改进最大匹配快速中文分词算法,对做中文分词会有所帮助-Maximum speed based on improved Chinese word matching algorithms, will be done to help the Chinese word segmentation
Platform: | Size: 200704 | Author: 张林 | Hits:

[VC/MFCTextMatchApp

Description: 基于最大公共子集的文本匹配算法的实现,可以用于字符串匹配,汉子匹配,文本匹配。-Subset based on the maximum public realization of the text matching algorithm can be used for string matching, man matching, text matching.
Platform: | Size: 52529152 | Author: 易爱春 | Hits:

[Special EffectsQingXiHua

Description: 该算法是关于图像清晰化的算法,里边包含了光流法,块匹配,凸集投影和最大后验概率等,是很好的参考东西。-The algorithm is an algorithm for image clarity, inside includes optical flow, block matching, convex set projection and maximum a posteriori probability, is a good reference for things.
Platform: | Size: 3850240 | Author: 王美丽 | Hits:

[GUI Developimgproc2

Description: * Image Processing - Blurring and softening - Sharpening - Embossing - Customised filters - Minimum, Maximum and Average Rank filters for impressionistic effects * Colour Manipulation - Colourise images - Darken and Light images - Gray scale images - Floyd Stucci Black and White conversion - Decrease colour depth by dithering and matching to a specified palette. * Image Combination - Add, subtract with offsets or take the darkest/lightest pixels * Resample Images - Use interpolation to create a smooth resized version of an image. -* Image Processing - Blurring and softening - Sharpening - Embossing - Customised filters - Minimum, Maximum and Average Rank filters for impressionistic effects * Colour Manipulation - Colourise images - Darken and Light images - Gray scale images - Floyd Stucci Black and White conversion - Decrease colour depth by dithering and matching to a specified palette. * Image Combination - Add, subtract with offsets or take the darkest/lightest pixels * Resample Images - Use interpolation to create a smooth resized version of an image.
Platform: | Size: 145408 | Author: 子狐 | Hits:

[MultiLanguageEasySeg

Description: 实现中文分词的最大正向匹配算法,提前输入好文本。-Achieve maximum positive Chinese word matching algorithms, a good text input in advance
Platform: | Size: 923648 | Author: 宋园园 | Hits:
« 1 2 ... 4 5 6 7 8 910 11 12 »

CodeBus www.codebus.net